Fast Algebraic Immunity of $2^m+2$ & $2^m+3$ Variables Majority Function
نویسندگان
چکیده
منابع مشابه
Symmetric Boolean Function with Maximum Algebraic Immunity on Odd Number of Variables
The set of symmetric Boolean functions is an interesting subset of Boolean functions which have the function values determined by the weight of the vector. Symmetric functions can be represented in a very compact way both for their algebraic normal forms and for their value vectors. This property considerably reduces the amount of memory required for storing the function and is of great interes...
متن کاملOn the Algebraic Immunity of Boolean Function
In view of the construction requirements of Boolean functions with many good cryptography properties, through the analysis of the relationship between the function values on the vectors with weight not more than d and the algebraic immunity, a method to determine the higher order algebraic immunity function is given. Meanwhile, a method that appropriate change in the function value without redu...
متن کاملEfficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSR-based stream ciphers. An algorithm is described which permits to compute the algebraic immunity d of a Boolean function with n variables in O(D) operations, for D ≈ ` n d ́ , rather than in O(D) operations necessary in all p...
متن کاملOn the (Fast) Algebraic Immunity of Boolean Power Functions
The (fast) algebraic immunity, including (standard) algebraic immunity and the resistance against fast algebraic attacks, has been considered as an important cryptographic property for Boolean functions used in stream ciphers. This paper is on the determination of the (fast) algebraic immunity of a special class of Boolean functions, called Boolean power functions. An n-variable Boolean power f...
متن کاملAn Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
After the improvement by Courtois and Meier of the algebraic attacks on stream ciphers and the introduction of the related notion of algebraic immunity, several constructions of infinite classes of Boolean functions with optimum algebraic immunity have been proposed. All of them gave functions whose algebraic degrees are high enough for resisting the Berlekamp-Massey attack and the recent Rønjo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2923456